Multisearch Techniques: Parallel Data Structures on Mesh-Connected Computers
نویسندگان
چکیده
منابع مشابه
Multisearch Techniques: Parallel Data Structures on Mesh-Connected Computers
The multisearch problem is de ned as follows. Given a data structure D modeled as a graph with n constant-degree nodes, performO(n) searches on D. Let r be the length of the longest search path associated with a search process, and assume that the paths are determined \on-line". That is, the search paths may overlap arbitrarily. In this paper, we solve the multisearch problem for certain classe...
متن کاملMultisearch Techniques of Hierarchical DAGs on Mesh-Connected Computers, with Applications
We present a technique for optimally performing n searches of an n-vertex hierarchical DAG on Mesh-Connected Computers. As immediate consequences of this. we obtain the first optimal mesh algorithms for the problems of computing the convex: hull of a. set of 3-dimensional points, and of computing the intersection of two 3-dimensional convex polyhedra. The best previously known bounds for these ...
متن کاملConnected components algorithms for mesh-connected parallel computers
We present a new CREW PRAM algorithm for nding connected components. For a graphG with n vertices andm edges, algorithmA0 requires at mostO(logn) parallel steps and performsO((n+m) logn) work in the worst case. The advantage our algorithm has over others in the literature is that it can be adapted to a 2-D mesh-connected communication model in which all CREW operations are replaced byO(logn) pa...
متن کاملParallel B-Spline Surface Fitting on Mesh-Connected Computers
sented, where cost is defined to be the product of time and the number of processors used [19]. Using a newly proposed computational model called the mesh-of-unshuffle network, Chung and Lin [7] presented an O(log m log n)-time parallel algorithm using O(mn/(log m log n)) processors. On a hypercube network, a similar result was presented by Lin and Chung [20]. Using the pipelining strategy [11]...
متن کاملOptimal Parallel Algorithms for Multiselection on Mesh-Connected Computers
Multiselection is the problem of selecting multiple elements at specified ranks from a set of arbitrary elements. In this paper, we first present an efficient algorithm for single-element selection that runs in O( √ p+ np log p log(kp/n)) time for selecting the kth smallest element from n elements on a √ p × √p mesh-connected computer of p ≤ n processors, where the first component is for commun...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Parallel and Distributed Computing
سال: 1994
ISSN: 0743-7315
DOI: 10.1006/jpdc.1994.1001